Fqmr : a Flexible Quasi - Minimal Residual Methodwith Inexact Preconditioning ( Preliminary Report ) Daniel
نویسندگان
چکیده
A exible version of the QMR algorithm is presented which allows for the use of a diierent preconditioner at each step of the algorithm. In particular, inexact solutions of the preconditioned equations are allowed, as well as the use of some (inner) iterative method as a preconditioner. Several theorems are presented relating the norm of the residual of the new method with the norm of the residual of other methods, including QMR and FGMRES.
منابع مشابه
FQMR: A Flexible Quasi-Minimal Residual Method with Inexact Preconditioning
A flexible version of the QMR algorithm is presented which allows for the use of a different preconditioner at each step of the algorithm. In particular, inexact solutions of the preconditioned equations are allowed, as well as the use of an (inner) iterative method as a preconditioner. Several theorems are presented relating the norm of the residual of the new method with the norm of the resid...
متن کاملTwo recursive GMRES-type methods for shifted linear systems with general preconditioning
We present two minimum residual methods for solving sequences of shifted linear systems, the right-preconditioned shifted GMRES and shifted Recycled GMRES algorithms which use a seed projection strategy often employed to solve multiple related problems. These methods are compatible with general preconditioning of all systems, and when restricted to right preconditioning, require no extra applic...
متن کاملAn Efficient and Effective Nonlinear Solver in a Parallel Software for Large Scale Petroleum Reservoir Simulation
We study a parallel Newton-Krylov-Schwarz (NKS) based algorithm for solving large sparse systems resulting from a fully implicit discretization of partial differential equations arising from petroleum reservoir simulations. Our NKS algorithm is designed by combining an inexact Newton method with a rank-2 updated quasi-Newton method. In order to improve the computational efficiency, both DDM and...
متن کاملInexact GMRES for singular linear systems
Inexact Krylov subspace methods have been shown to be practical alternatives for the solution of certain linear systems of equations. In this paper, the solution of singular systems with inexact matrix-vector products is explored. Criteria are developed to prescribe how inexact the matrix-vector products can be, so that the computed residual remains close to the true residual, thus making the i...
متن کاملOn the Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
We present a general analytical model which describes the superlinear convergence of Krylov subspace methods. We take an invariant subspace approach, so that our results apply also to inexact methods, and to non-diagonalizable matrices. Thus, we provide a unified treatment of the superlinear convergence of GMRES, Conjugate Gradients, block versions of these, and inexact subspace methods. Numeri...
متن کامل